Cycle-aware minimization of acyclic deterministic finite-state automata
نویسندگان
چکیده
منابع مشابه
Cycle Analysis for Deterministic Finite State Automata
A method for the determination of all cycles of deterministic finite state automata is presented. Using a finite field description GF(2) these automata are shown to correspond to multilinear state equations. Basic results from feedback shift register theory are recalled and developed towards a complete analysis tool for affine-linear automata. The multilinear case is reduced to the affine-linea...
متن کاملExact Generation of Acyclic Deterministic Finite Automata
We give a canonical representation for trim acyclic deterministic finite automata (ADFA) with n states over an alphabet of k symbols. Using this normal form, we present a backtracking algorithm for the exact generation of ADFAs. This algorithm is a non trivial adaptation of the algorithm for the exact generation of minimal acyclic deterministic finite automata (MADFA), presented by Almeida et al..
متن کاملMINIMIZATION OF DETERMINISTIC FINITE AUTOMATA WITH VAGUE (FINAL) STATES AND INTUITIONISTIC FUZZY (FINAL) STATES
In this paper, relations among the membership values of gener- alized fuzzy languages such as intuitionistic fuzzy language, interval-valued fuzzy language and vague language are studied. It will aid in studying the properties of one language when the properties of another are known. Further, existence of a minimized nite automaton with vague ( final) states for any vague regular language recog...
متن کاملExact Generation of Minimal Acyclic Deterministic Finite Automata
We give a canonical representation for minimal acyclic deterministic finite automata (MADFA) with n states over an alphabet of k symbols. Using this normal form, we present a method for the exact generation of MADFAs. This method avoids a rejection phase, that would be needed if a generation algorithm for a larger class of objects that contains the MADFAs were used. We give an upper bound for M...
متن کاملModular Minimization of Deterministic Finite State Machines
This work presents a modular technique for minimizing a deterministic nite state ma chine FSM while preserving its equivalence to the original system Being modular the minimization technique should consume less time and space Preserving equivalence the resulting minimized model can be employed in both temporal logic model checking and sequential equivalence checking thus reducing their time and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2014
ISSN: 0166-218X
DOI: 10.1016/j.dam.2013.08.003